Transforming Binary Sequences Using Priority Queues
نویسنده
چکیده
A priority queue transforms an input sequence ~r into an output sequence r which is a re-ordering of the sequence ~r. The set R of all such related pairs is studied in the case that tr is a binary sequence. It is proved that R is a partial order and that IRI = c,~+1, the (n + 1)th Catalan number, An efficient (O(n2)) algorithm is given for computing the number of outputs achievable from a given input. Mathematics Subject Classification (1991). 06A06.
منابع مشابه
Experimental Study of High Performance Priority Queues
The priority queue is a very important and widely used data structure in computer science, with a variety of applications including Dijkstra’s Single Source Shortest Path algorithm on sparse graph types. This study presents the experimental results of a variety of priority queues. The focus of the experiments is to measure the speed and performance of highly specialized priority queues in out-o...
متن کاملA Survey on Priority Queues
Back in 1964 Williams introduced the binary heap as a basic priority queue data structure supporting the operations Insert and ExtractMin in logarithmic time. Since then numerous papers have been published on priority queues. This paper tries to list some of the directions research on priority queues has taken the last 50 years.
متن کاملMeasuring and Improving the Performance of Cache-efficient Priority Queues in Dijkstra’s Algorithm
The priority queue is an useful data structure in computation. There currently exist many implementations of this data structure, including some that are cache-aware and some cache-oblivious. In this study, we compare the performance of several implementations of priority queues in Dijkstra’s Single Source Shortest Path algorithm. We compare high performance heaps, such as the 4ary Aligned Heap...
متن کاملTwo new methods for transforming priority queues into double - ended priority queues ∗
Two new ways of transforming a priority queue into a double-ended priority queue are introduced. These methods can be used to improve all known bounds for the comparison complexity of double-ended priority-queue operations. Using an efficient priority queue, the first transformation can produce a doubleended priority queue which guarantees the worst-case cost of O(1) for find -min , find-max , ...
متن کاملTheoretical and practical efficiency of priority queues
This is a study of the theoretical and practical efficiency of priority queues. The priority queue is an old and well studied data structure on which a great deal of theoretical and practical work has already been done. A priority queue can be realised in many ways, some of the most commonly used data structures for this are binary heaps and binomial queues. In this thesis the efficiency of pri...
متن کامل